Merge sort is one of the most efficient sorting algorithms. Like my previous Quick Sort(from day 8 of 100), It works on the principle of Divide and Conquer. Merge sort repeatedly breaks down a list into several sublists until each sublist consists of a single element and merging those sublists in a manner that results into a sorted list.
Day 12 of "100 days of coding".